Rule of 78s — Also known as the sum of the digits method, the Rule of 78s is a term used in lending that refers to a method of yearly interest calculation. The name comes from the total number of months interest that is being calculated in a year (the first… … Wikipedia
Ziggurat algorithm — The ziggurat algorithm is an algorithm to generate random numbers from a non uniform distribution. It belongs to the class of rejection sampling algorithms and can be used for choosing values from a monotone decreasing probability distribution.… … Wikipedia
Self-consistent mean field (biology) — The self consistent mean field (SCMF) method is an adaptation of mean field theory used in protein structure prediction to determine the optimal amino acid side chain packing given a fixed protein backboneref|Koehl. It is faster but less accurate … Wikipedia
Scale-invariant feature transform — Feature detection Output of a typical corner detection algorithm … Wikipedia
Rendering (computer graphics) — Not to be confused with 3D rendering. A variety of rendering techniques applied to a single 3D scene … Wikipedia
Backgammon — A backgammon set, consisting of a board, two sets of 15 checkers, two pairs of dice, a doubling cube, and dice cups Years active Approximately 5,000 years ago to present Genre(s) Board game, dice game … Wikipedia
OLPC XO-1 — XO 1 Manufacturer Quanta Computer Media 1 GB flash memory Operating system … Wikipedia
Waypoint — A waypoint is a reference point in physical space used for purposes of navigation.ConceptWaypoints are sets of coordinates that identify a point in physical space. For the purposes of terrestrial navigation, these coordinates usually include… … Wikipedia
Spherical harmonics — In mathematics, the spherical harmonics are the angular portion of an orthogonal set of solutions to Laplace s equation represented in a system of spherical coordinates. Spherical harmonics are important in many theoretical and practical… … Wikipedia
Cooley–Tukey FFT algorithm — The Cooley–Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N1N2 in terms of smaller DFTs… … Wikipedia